Visual Representation of Searched Results using Tree Diagram
نویسندگان
چکیده
This paper presents a new search method and the representation of results via tree diagram. As the reliance on computers increases, so will the volume of data and information stored in them. Storing of data and information on the computer is not a difficult task, but what is more daunting is searching for the file that you have stored. Currently on a Windows Operating System File Search method, users are able to search for a file and the results are displayed immediately with no structure. A prototype was built in this research to enable users to search a file based on its contents followed by a recommendation to display results via tree diagram for returned search results. It was found that search result that is visually displayed via tree diagram offered users a visual representation of where the relative location of the file is stored. Future work should enhance the ability of the tree diagram display to be interactive.
منابع مشابه
The Effect of Visual Representation, Textual Representation, and Glossing on Second Language Vocabulary Learning
In this study, the researcher chose three different vocabulary techniques (Visual Representation, Textual Enhancement, and Glossing) and compared them with traditional method of teaching vocabulary. 80 advanced EFL Learners were assigned as four intact groups (three experimental and one control group) through using a proficiency test and a vocabulary test as a pre-test. In the visual group, stu...
متن کاملTree Diagrams for String Links
In previous work [7], the author defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملConcatenation - Based Greedy Heuristics for the Euclidean
We present a class of O(n log n) heuristics for the Steiner tree problem in the Euclidean plane. These heuristics identify a small number of subsets with few, geometrically close, terminals using minimum spanning trees and other well-known structures from computational geometry: De-launay triangulations, Gabriel graphs, relative neighbourhood graphs, and higher-order Voronoi diagrams. Full Stei...
متن کاملGeometric Data Structures and Their Selected Applications
Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011